-
1 strongly disjoint sets
Математика: сильно непересекающиеся множестваУниверсальный англо-русский словарь > strongly disjoint sets
-
2 strongly disjoint sets
English-Russian scientific dictionary > strongly disjoint sets
-
3 disjoint
1) несовместимый; несовместный; дизъюнктный2) матем. непересекающийся3) разделять; расчленять; рассоединять4) не пересекаться; не иметь общих элементов•disjoint [disjunctive] ideal — дизъюнктный идеал
linearly disjoint extensions — линейно свободные расширения, линейно разделенные расширения
mutually disjoint [mutually exclusive] sets — непересекающиеся множества
-
4 set
1) набор; комплект- semiconductor assembly set - set of Belleville springs - set of conventional set - set of drawing instruments - set of gate patterns - set of gauge blocks - set of logical elements - set of statistical data - set of technical aids- snap set2) партия3) совокупность; множество4) установка; агрегат- desk telephone set - dial telephone set- gear set- local-battery telephone set - man-pack radio set - multi-operator welding set - sound-powered telephone set - wall telephone set5) регулировка; настройка || регулировать; настраивать6) группа; ансамбль7) класс; семейство9) схватывание || схватываться10) затвердевание || затвердевать11) крепление || закреплять12) геол. свита пород13) осадка (грунта) || оседать ( о грунте)14) радиоточка15) спорт сет16) включать, приводить в действие17) мат. множествоset closed under operation — множество, замкнутое относительно операции
- absolutely compact set - absolutely continuous set - absolutely convex set - absolutely irreducible set - absolutely measurable set - affinely independent set - affinely invariant set - algebraically independent set - almost finite set - almost full set - angular cluster set - asymptotically indecomposable set - at most denumerable set - centro-symmetric set - completely bounded set - completely continuous set - completely generating set - completely improper set - completely irreducible set - completely nonatomic set - completely normal set - completely ordered set - completely productive set - completely reducible set - completely separable set - constructively nonrecursive set - convexly independent set - countably infinite setto set aside — не учитывать, не принимать во внимание; откладывать
- cut set- cyclically ordered set - deductively inconsistent set - derived set - doubly well-ordered set - dual set of equations - dynamically disconnected set - effectively enumerable set - effectively generating set - effectively nonrecursive set - effectively simple set - enumeration reducible set - finely perfect set - finitely definite set - finitely measurable set- flat set- full set- fully reducible set - functionally closed set - functionally complete set - functionally open set - fundamental probability set - generalized almost periodic set- goal set- internally stable set- knot set- left directed set - left normal set - left-hand cluster set - linearly ordered set - local peak set - locally arcwise set - locally closed set - locally compact set - locally connected set - locally contractible set - locally convex set - locally finite set - locally invariant set - locally negligible set - locally null set - locally polar set - locally polyhedral set - metrically bounded set - metrically dense set - multiply ordered set - nearly analytic set - nearly closed set - nonvoid set - normally ordered set- null set- open in rays set - partitioned data set- peak set- pole set- positively homothetic set- pure set- radially open set - rationally independent set - recursively creative set - recursively indecomposable set - recursively isomorphic set - recursively productive set - regularly convex set - regularly situated sets - relatively closed set - relatively compact set - relatively dense set - relatively interpretable set - relatively open set - right normal set - right-hand cluster set- scar set- sequentially complete set - serially ordered set - set of elementary events - set of first category - set of first kind - set of first species - set of possible outcomes - set of probability null - set of second category - set of second species - shift invariant set - simply connected set - simply ordered set - simply transitive set- skew set- star set- strongly bounded set - strongly closed set - strongly compact set - strongly connected set - strongly convex set - strongly dependent set - strongly disjoint sets - strongly enumerable set - strongly independent set - strongly minimal set - strongly polar set - strongly reducible set - strongly separated set - strongly simple set - strongly stratified set- tame set- tautologically complete set - tautologically consistent set - tautologically inconsistent set- test set- thin set- tie set- time set- totally disconnected set - totally imperfect set - totally ordered set - totally primitive set - totally unimodular set - totally unordered set - truth-table reducible set - uniformly bounded set - uniformly continuous set - uniformly convergent set - uniformly integrable set - uniformly universal set - unilaterally connected set- unit set- vacuous set- void set- weakly compact set - weakly convex set - weakly n-dimensional set - weakly stratified set - weakly wandering set - well chained set - well founded set - well measurable set - well ordering set - well quasiordered set
См. также в других словарях:
Constructible universe — Gödel universe redirects here. For Kurt Gödel s cosmological solution to the Einstein field equations, see Gödel metric. In mathematics, the constructible universe (or Gödel s constructible universe), denoted L, is a particular class of sets… … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
logic, history of — Introduction the history of the discipline from its origins among the ancient Greeks to the present time. Origins of logic in the West Precursors of ancient logic There was a medieval tradition according to which the Greek philosopher … Universalium
Symbolic combinatorics — in mathematics is a technique of analytic combinatorics that uses symbolic representations of combinatorial classes to derive their generating functions. The underlying mathematics, including the Pólya enumeration theorem, are explained on the… … Wikipedia
Dempster-Shafer theory — The Dempster Shafer theory is a mathematical theory of evidenceShafer, Glenn; A Mathematical Theory of Evidence , Princeton University Press, 1976, ISBN 0 608 02508 9] based on belief functions and plausible reasoning , which is used to combine… … Wikipedia
Dempster–Shafer theory — Prof Arthur P. Dempster at the workshop on Belief Function Theory (Brest 1 april 2010). The Dempster–Shafer theory (DST) is a mathematical theory of evidence.[1] It allows … Wikipedia
Alias analysis — is a technique in compiler theory, used to determine if a storage location may be accessed in more than one way. Two pointers are said to be aliased if they point to the same location. Alias analysis techniques are usually classified by flow… … Wikipedia
Ethernet — An 8P8C modular connector (often called RJ45) commonly used on cat 5 cables in Ethernet networks Ethernet … Wikipedia
Fundamental modeling concepts — (FMC) provide a framework to describe software intensive systems. It strongly emphasizes the communication about software intensive systems by using a semi formal graphical notation that can easily be understood. Introduction FMC distinguishes… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
